Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distributed Memory Architectures
نویسندگان
چکیده
منابع مشابه
Parallel Performance Prediction for Multigrid Codes on Distributed Memory Architectures
We propose a model for describing the parallel performance of multigrid software on distributed memory architectures. The goal of the model is to allow reliable predictions to be made as to the execution time of a given code on a large number of processors, of a given parallel system, by only benchmarking the code on small numbers of processors. This has potential applications for the schedulin...
متن کاملOverlap-free Karatsuba-Ofman Polynomial Multiplication Algorithm
Published in 1962 [1], Karatsuba-Ofman algorithm (KOA) was the first integer multiplication method broke the quadratic complexity barrier in positional number systems. Due to its simplicity, its polynomial version is widely adopted to design VLSI GF (2) parallel multipliers in GF (2)based cryptosystems [9]-[27]. Two parameters are often used to measure the performance of a GF (2) parallel multi...
متن کاملImplementation of Karatsuba Algorithm Using Polynomial Multiplication
Abstract Efficiency in multiplication is very important in applications like signal processing, cryptosystems and coding theory. This paper presents the design of a fast multiplier using the Karatsuba algorithm to multiply two numbers using the technique of polynomial multiplication. The Karatsuba algorithm saves coefficient multiplications at the cost of extra additions as compared to the ordi...
متن کاملInstruction sequence expressions for the Karatsuba multiplication algorithm
The Karatsuba multiplication algorithm is an algorithm for computing the product of two natural numbers represented in the binary number system. This means that the algorithm actually computes a function on bit strings. The restriction of this function to bit strings of any given length can be computed according to the Karatsuba multiplication algorithm by a finite instruction sequence that con...
متن کاملPerformance of Parallel Genetic Algorithms on Distributed Memory Architectures
The Genetic Algorithms draw a similarity from the Genetic mutation and Cross Over within populations from biology. The genetic algorithms are highly parallel in nature. These can be used to solve many important problems like Graph Partitioning, Travelling salesman problems, 0-1 Integer linear programming problem etc. When these are implemented, there exists a trade-off between Genetic search qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1996
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0026